Computational Complexity of Computing a Quasi-Proper Equilibrium

We study the computational complexity of computing or approximating a quasi-proper equilibrium for given finite extensive form game perfect recall. show that task symbolic is \(\mathrm {PPAD}\)-complete two-player games. For case zero-sum games we obtain polynomial time algorithm based on Linear Programming. general n-player an approximation {FIXP}_a\)-complete. Towards our results devise new perturbation strategy space which in particular gives proof existence equilibria